A Data-Driven Vulnerability Evaluation Method in Grid Edge Based on Random Matrix Theory Indicators
نویسندگان
چکیده
منابع مشابه
First colonization of a hard-edge in random matrix theory
We describe the spectral statistics of the first finite number of eigenvalues in a newly-forming band on the hardedge of the spectrum of a random Hermitean matrix model. It is found that in a suitable scaling regime, they are described by the same spectral statistics of a finite-size Laguerre-type matrix model. The method is rigorously based on the Riemann-Hilbert analysis of the corresponding ...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملA novel method for detecting structural damage based on data-driven and similarity-based techniques under environmental and operational changes
The applications of time series modeling and statistical similarity methods to structural health monitoring (SHM) provide promising and capable approaches to structural damage detection. The main aim of this article is to propose an efficient univariate similarity method named as Kullback similarity (KS) for identifying the location of damage and estimating the level of damage severity. An impr...
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملOn the Diaconis-Shahshahani Method in Random Matrix Theory
If is a random variable with values in a compact matrix group K , then the traces Tr( j ) ( j ∈ N) are real or complex valued random variables. As a crucial step in their approach to random matrix eigenvalues, Diaconis and Shahshahani computed the joint moments of any fixed number of these traces if is distributed according to Haar measure and if K is one of Un, On or Spn , where n is large eno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2971030